Dispersion estimation from linear array data in the time-frequency plane
نویسندگان
چکیده
منابع مشابه
Discriminant linear processing of time-frequency plane
Extending previous works done on considerably smaller data sets, the paper studies linear discriminant analysis of about 30 hours of phoneme-labeled speech data in the time-frequency domain. Analysis is carried both independently in time and frequency and jointly. Data driven spectral basis show similar frequency sensitivity as human hearing. LDA-derived temporal FIR filters are consistent with...
متن کاملDiversity Analysis for Linear Dispersion over Time and Frequency
To improve performance of orthogonal frequency division multiplexing (OFDM) for fading channels, linear dispersion coded OFDM (LDC-OFDM) was recently proposed to increase frequency and time diversity with high bandwith efficiency and performance. The performance of recently proposed LDC-OFDM was investigated through simulations. This paper analyzes the diversity aspects of LDCOFDM system, and s...
متن کاملModal parameter estimation from ambient data using time-frequency analysis
Abstract Modal parameter estimation of randomly and ambient excited structures using output-only system identification techniques has become a recently essential issue for assessment of engineering structures, structural health monitoring and structural control. A number of mathematical models on the output-only identification techniques have been developed in the time domain, in the frequency ...
متن کاملRate matrix estimation from site frequency data.
A procedure is described for estimating evolutionary rate matrices from observed site frequency data. The procedure assumes (1) that the data are obtained from a constant size population evolving according to a stationary Wright-Fisher or decoupled Moran model; (2) that the data consist of a multiple alignment of a moderate number of sequenced genomes drawn randomly from the population; and (3)...
متن کاملVerifying a Border Array in Linear Time
A border of a string x is a proper (but possibly empty) prefix of x that is also a suffix of x. The border array β = β[1..n] of a string x = x[1..n] is an array of nonnegative integers in which each element β[i], 1 ≤ i ≤ n, is the length of the longest border of x[1..i]. In this paper we first present a simple linear-time algorithm to determine whether or not a given array y = y[1..n] of intege...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Signal Processing
سال: 2005
ISSN: 1053-587X
DOI: 10.1109/tsp.2005.855430